منابع مشابه
Weakly Distance-Regular Digraphs of Girth 2
In this paper, we give two constructions of weakly distance-regular digraphs of girth 2, and prove that certain quotient digraph of a commutative weakly distancetransitive digraph of girth 2 is a distance-transitive graph. As an application of the result, we not only give some constructions of weakly distance-regular digraphs which are not weakly distance-transitive, but determine a special cla...
متن کاملTitle : A Family of Weakly Distance - Regular Digraphs of Girth
All weakly distance-regular digraphs with girth $2$ and k-k_{1,1}=1 are classified. A Family of Weakly Distance-Regular Digraphs of Girth 2 Kaishun Wang∗ School of Mathematical Sciences Beijing Normal University Beijing 100875, P.R. China Abstract All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are classified.All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 ...
متن کاملA family of weakly distance-regular digraphs of girth 2
All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are determined. Moreover, all such digraphs are commutative.
متن کاملSubgraphs Graph in a Distance-regular Graph
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We sh...
متن کاملA Questionable Distance-Regular Graph
In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection numbers. We discuss results following from the definition of the intersection algebra. We investigate two examples of distance-regular graphs and show how these results apply. Finally, we introduce parameters that determine intersection numbers. We inves...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 1997
ISSN: 0911-0119,1435-5914
DOI: 10.1007/bf01202234